Rank-width: Algorithmic and structural results
نویسنده
چکیده
Rank-width is a width parameter of graphs describing whether it is possible to decompose a graph into a tree-like structure by ‘simple’ cuts. This survey aims to summarize known algorithmic and structural results on rank-width of graphs.
منابع مشابه
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
Many NP-hard graph problems can be efficiently solved on graphs of bounded tree-width. Several articles have recently shown that the so-called rank-width parameter also allows efficient solution of most of these NP-hard problems, while being less restrictive than tree-width. On the other hand however, there exist problems of practical importance which remain hard on graphs of bounded rank-width...
متن کاملGraph Operations Characterizing Rank-Width and Balanced Graph Expressions
Graph complexity measures like tree-width, clique-width, NLC-width and rank-width are important because they yield Fixed Parameter Tractable algorithms. Rank-width is based on ranks of adjacency matrices of graphs over GF(2). We propose here algebraic operations on graphs that characterize rank-width. For algorithmic purposes, it is important to represent graphs by balanced terms. We give a uni...
متن کاملA unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
In this paper we develop new algorithmic machinery for solving hard problems on graphs of bounded rank-width and on digraphs of bounded bi-rank-width in polynomial (XP, to be precise) time. These include, particularly, graph colouring and chromatic polynomial problems, the Hamiltonian path and c-min-leaf outbranching, the directed cut, and more generally MSOL-partitioning problems on digraphs. ...
متن کاملDirected Rank-Width and Displit Decomposition
Rank-width is a graph complexity measure that has many structural properties. It is known that the rank-width of an undirected graph is the maximum over all induced prime graphs with respect to split decomposition and an undirected graph has rank-width at most 1 if and only if it is a distance-hereditary graph. We are interested in an extension of these results to directed graphs. We give sever...
متن کاملRank-width and vertex-minors
The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is known analogous to graph minor embedding for tree-width. In this paper, we discuss the vertex-minor relation of graphs and its connection with rank-width. We prove a relationship between vertex-minors of bipartit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 231 شماره
صفحات -
تاریخ انتشار 2017